A Probabilistic Counting Algorithm
نویسندگان
چکیده
This talk1 (a joint work with Philippe Flajolet) presents an algorithm to approximate count the number of different words in very large sets or texts (in the range of billions of bytes) and its analysis. When using an auxiliary memory of m bytes, the accuracy is of the order 1/ √ m. The analysis of this new algorithm relies on asymptotic Depoissonization techniques.
منابع مشابه
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically, Probabilistic-FF combines Conformant-FF’s techniques with a powerful machinery for weighted model counting in ...
متن کاملExplanation-Based Approximate Weighted Model Counting for Probabilistic Logics
Probabilistic inference can be realized using weighted model counting. Despite a lot of progress, computing weighted model counts exactly is still infeasible for many problems of interest, and one typically has to resort to approximation methods. We contribute a new bounded approximation method for weighted model counting based on probabilistic logic programming principles. Our bounded approxim...
متن کاملNovel Algorithms TempCIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Temporal Databases and Future Possibilities
In this paper we present novel algorithms TempCIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Temporal Databases and we also discussed future possibilities. We consider the problem of discovering frequent itemsets and association-rules between/among items in a large database of transactional databases acquired under uncertainty in certain time. With each timestamp...
متن کاملRandomness and Counting 6.1 Probabilistic Polynomial-time Construction 6.4 (the Reduction): on Input a Natural Number N > 2 Do
I owe this almost atrocious variety to an institution which other republics do not know or which operates in them in an imperfect and secret manner: the lottery. So far, our approach to computing devices was somewhat conservative: we thought of them as executing a deterministic rule. A more liberal and quite realistic approach , which is pursued in this chapter, considers computing devices that...
متن کاملProbabilistic Planning via Heuristic Forward Search and Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically, Probabilistic-FF combines Conformant-FF’s techniques with a powerful machinery for weighted model counting in ...
متن کاملNovel Algorithms CIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Databases and Future Possibilities
We consider the problem of discovering frequent item sets and association rules between items in a large database of transactional databases acquired under uncertainty. A probabilistic database considered here is one in which with each transaction associated is a probability, represents the confidence that the transaction will occur with given associated certainty. In this paper, we address the...
متن کامل